Szeged, Padmakar-Ivan (PI), and Mostar indices are some of the most investigated distance-based Szeged-like topological indices. On other hand, polynomials related to these were also introduced, for example Szeged polynomial, edgeSzeged PI etc. In this paper, we introduce a concept general polynomial connected strength-weighted graph. It turns out that includes all above mentioned infinitely ma...

The edge Szeged polynomial of a graph G is defined as Sze(G,x) = ( ) ( ) , u v m e m e e uv x = ∑ where mu(e) is the number of edges of G lying closer to u than to v and mv(e) is the number of edges of G lying closer to v than to u. In this paper the main properties of this newly proposed polynomial are investigated. We also compute this polynomial for some classes of well-known graphs. Finally...

Szeged-like topological indices are well-studied distance-based molecular descriptors, which include, for example, the (edge-)Szeged index, (edge-)Mostar and (vertex-)PI index. For these indices, corresponding polynomials were also defined, i.e., polynomial, Mostar PI etc. It is well known that, by evaluating first derivative of such a polynomial at x=1, we obtain related The aim this paper to ...

A topological index of a graph G is a numeric quantity related to G which is invariant under automorphisms of G. A new counting polynomial, called the "Omega" W(G, x) polynomial, was recently proposed by Diudea on the ground of quasi-orthogonal cut "qoc" edge strips in a polycyclic graph. In this paper, the vertex PI, Szeged and omega polynomials of carbon nanocones CNC4[n] are computed.

Effects of alcohol on pancreatic ductal function József Maléth , Zoltán Rakonczay , Viktória Venglovecz, Péter Hegyi First Department of Medicine, University of Szeged, Szeged, Hungary MTA-SZTE Translational Gastroenterology Research Group, Szeged, Hungary Department of Pathophysiology, University of Szeged, Szeged, Hungary Department of Pharmacology and Pharmacotherapy, University of Szeged, S...

Subgraphs obtained by applying several fragmentation criteria are investigated. Two well known criteria (Szeged and Cluj), and two new others are defined and characterized. An example is given for the discussed procedures. The matrix and polynomial representations of vertices composing each type of subgraphs were also given. Analytical formulas for the polynomials of several classes of graphs a...

A theory, in this context, is a Boolean formula; it is used to classify instances, or truth assignments. Theories can model real-world phenomena, and can do so more or less correctly. The theory revision, or concept revision, problem is to correct a given, roughly correct concept. This problem is considered here in the model of learning with equivalence and membership queries. A revision algori...

Zoltan Alexin Department of Informatics University of Szeged [email protected]—szeged.hu Tibor Gyinnithy Research Group on Artifical Intelligence at University of Szeged [email protected]—szeged.hu Csaba Hatvani Department of Informatics University of Szeged [email protected]—szeged.hu LaszlO Tihanyi MorphoLogic Budapest [email protected] Janos Csirik Department of Informatics University of Szeged csiri...